Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient
نویسندگان
چکیده
منابع مشابه
Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient
In this paper we consider solutions to the static dictionary problem on ACo RAMs, i.e. random access machines where the only restriction on theJinite instruction set is that all computationcil instructions are in ACO. Our main result is a tight upper and lower bound of 0 (Jlog n / log log n ) on the time for (answering membership queries in a set of size n when reasonable space is used for the ...
متن کاملDictionaries on AC 0 RAMs : Query Time Θ ( √ log n / log log n ) is Necessary and Sufficient
In this paper we consider solutions to the dictionary problem on AC RAMs, i.e. random access machines where the only restriction on the finite instruction set is that all computational instructions are in AC. Our main result is a tight upper and lower bound of Θ( √ log n/ log log n) on the time for answering membership queries in a set of size n when reasonable space is used for the data struct...
متن کاملStatic Dictionaries on RAMs: Query time is necessary and sufficient
In this paper we consider solutions to the static dictionary problem on RAMs, i.e. random access machines where the only restriction on the finite instruction set is that all computational instructions are in . Our main result is a tight upper and lower bound of "! #%$ &('*)+#,$-&.#,$-&('0/ on the time for answering membership queries in a set of size ' when reasonable space is used for the dat...
متن کاملConvex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملBounded Ordered Dictionaries in O(log log N) Time and O(n) Space
In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space E77].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i14.21678